Mixed means over balls and annuli and lower bounds for operator norms of maximal functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means

We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)

متن کامل

Lower Bounds for Pinning Lines by Balls

A line l is a transversal to a family F of convex objects in R if it intersects every member of F . In this paper we show that for every integer d ≥ 3 there exists a family of 2d− 1 pairwise disjoint unit balls in R with the property that every subfamily of size 2d − 2 admits a transversal, yet any line misses at least one member of the family. This answers a question of Danzer from 1957. Key-w...

متن کامل

Upper and lower bounds for numerical radii of block shifts

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

متن کامل

Coefficient bounds for a new class of univalent functions involving Salagean operator and the modified Sigmoid function

We define a new subclass of univalent function based on Salagean differential operator and obtained the initial Taylor coefficients using the techniques of Briot-Bouquet differential subordination in association with the modified sigmoid function. Further we obtain the classical Fekete-Szego inequality results.

متن کامل

Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols

This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2). The key is the use of (known) norms on Boolean functions, which capture their proximity to each of these models (and are closely related to property testers of this proximity). The main contributions are new XOR lemmas. We sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2004

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2003.11.018